Graphs without K₄ and well-quasi-orderingTHOMAS, R.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 3, pp 240-247, issn 0095-8956Article

Boxicity of series-parallel graphsBOHRA, Ankur; SUNIL CHANDRAN, L; KRISHNAM RAJU, J et al.Discrete mathematics. 2006, Vol 306, Num 18, pp 2219-2221, issn 0012-365X, 3 p.Article

A linear-time algorithm for computing K-terminal reliability in series-parallel networksSATYANARAYANA, A; KEVIN WOOD, R.SIAM journal on computing (Print). 1985, Vol 14, Num 4, pp 818-832, issn 0097-5397Article

Series-parallel graphs and depth-first search treesSYSLO, M. M.IEEE transactions on circuits and systems. 1984, Vol 31, Num 12, pp 1029-1033, issn 0098-4094Article

A compact labelling scheme for series-parallel graphsSTEINER, G.Discrete applied mathematics. 1985, Vol 11, Num 3, pp 281-297, issn 0166-218XArticle

k-edge connected polyhedra on series-parallel graphsDIDI BIHA, M; MAHJOUB, A. R.Operations research letters. 1996, Vol 19, Num 2, pp 71-78, issn 0167-6377Article

COMBINATORIAL PROBLEMS ON SERIES-PARALLEL GRAPHSTAKAMIZAWA K; NISHIZEKI T; SAITO N et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 79-94; BIBL. 23 REF.Conference Paper

COMPARISONS ON BLOCKING PROBABILITIES FOR REGULAR SERIES PARALLEL CHANNEL GRAPHSDU DZ; HWANG FK.1982; BELL SYSTEM TECHNICAL JOURNAL; ISSN 0005-8580; USA; DA. 1982; VOL. 61; NO 8; PP. 1965-1973; BIBL. 10 REF.Article

NECESSARY AND SUFFICIENT CONDITIONS FOR A GRAPH TO BE THREE-TERMINAL SERIES-PARALLEL-CASCADE.NISHIZEKI T; SAITO N.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 3; PP. 344-361; BIBL. 10 REF.Article

Toughness threshold for the existence of 2-walks in K₄-minor-free graphsDVORAK, Zdenĕk; KRAL, Daniel; TESKA, Jakub et al.Discrete mathematics. 2010, Vol 310, Num 3, pp 642-651, issn 0012-365X, 10 p.Conference Paper

Algorithmes parallèles par flux dans les graphes: Des fondements aux applications = Flows parallel graph algorithms: From fundamentals to applicationsLalevee, Philippe; Feautrier, P.1995, 265 p.Thesis

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphsCHAIN-CHIN YEN; LEE, R. C. T.European journal of operational research. 1994, Vol 73, Num 1, pp 192-198, issn 0377-2217Article

Polygon-to-chain reductions work for networks with imperfect verticesLAI, M. K. F.Microelectronics and reliability. 1994, Vol 34, Num 2, pp 267-274, issn 0026-2714Article

Parallel recognition of series-parallel graphsEPPSTEIN, D.Information and computation (Print). 1992, Vol 98, Num 1, pp 41-55, issn 0890-5401Article

Entire choosability of near-outerplane graphsHETHERINGTON, Timothy J.Discrete mathematics. 2009, Vol 309, Num 8, pp 2153-2165, issn 0012-365X, 13 p.Article

Tight relation between the circular chromatic number and the girth of series-parallel graphsZHISHI PAN; XUDING ZHU.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 393-404, issn 0012-365XArticle

The graph partitioning polytope on series-parallel and 4-wheel free graphsSUNIL CHOPRA.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 1, pp 16-31, issn 0895-4801Article

Distance constrained labelings of K₄-minor free graphsKRAL, Daniel; NEJEDLY, Pavel.Discrete mathematics. 2009, Vol 309, Num 18, pp 5745-5756, issn 0012-365X, 12 p.Article

An order-specified multisignature scheme secure against active insider attacksTADA, Mitsuru.Lecture notes in computer science. 2002, pp 328-345, issn 0302-9743, isbn 3-540-43861-0, 18 p.Conference Paper

Two-edge connected spanning subgraphs and polyhedraALI RIDHA MAHJOUB.Mathematical programming. 1994, Vol 64, Num 2, pp 199-208, issn 0025-5610Article

On equitable and equitable list colorings of series―parallel graphsXIN ZHANG; WU, Jian-Liang.Discrete mathematics. 2011, Vol 311, Num 10-11, pp 800-803, issn 0012-365X, 4 p.Article

Maintaining the mental map for circular drawingsKAUFMANN, Michael; WIESE, Roland.Lecture notes in computer science. 2002, pp 12-22, issn 0302-9743, isbn 3-540-00158-1, 11 p.Conference Paper

A linear algorithm for edge-coloring series-parallel multigraphsXIAO ZHOU; SUZUKI, H; NISHIZEKI, T et al.Journal of algorithms (Print). 1996, Vol 20, Num 1, pp 174-201, issn 0196-6774Article

On shortest T-joins and packing T-cutsGERARDS, A. M. H.Journal of combinatorial theory. Series B. 1992, Vol 55, Num 1, pp 73-82, issn 0095-8956Article

SERIES-PARALLEL GRAPHS: A LOGICAL APPROACHMCKEE TA.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 177-181; BIBL. 13 REF.Article